TSTP Solution File: ITP239^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP239^1 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:07:42 EDT 2024

% Result   : Theorem 69.69s 22.27s
% Output   : CNFRefutation 69.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   36 (  17 unt;  19 typ;   0 def)
%            Number of atoms       :   17 (   8 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :  142 (   3   ~;   0   |;   0   &; 139   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :   13 (  13   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  15 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    nat: $tType ).

thf(decl_sort2,type,
    num: $tType ).

thf(decl_sort3,type,
    list_VEBT_VEBT: $tType ).

thf(decl_sort4,type,
    vEBT_VEBT: $tType ).

thf(decl_208,type,
    one_one_nat: nat ).

thf(decl_379,type,
    nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_405,type,
    suc: nat > nat ).

thf(decl_476,type,
    bit0: num > num ).

thf(decl_478,type,
    one: num ).

thf(decl_486,type,
    numeral_numeral_nat: num > nat ).

thf(decl_697,type,
    divide_divide_nat: nat > nat > nat ).

thf(decl_842,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_844,type,
    vEBT_VEBT_low: nat > nat > nat ).

thf(decl_861,type,
    vEBT_vebt_member: vEBT_VEBT > nat > $o ).

thf(decl_918,type,
    deg: nat ).

thf(decl_923,type,
    na: nat ).

thf(decl_924,type,
    pr: nat ).

thf(decl_927,type,
    treeList: list_VEBT_VEBT ).

thf(decl_929,type,
    za: nat ).

thf(conj_0,conjecture,
    vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eL74IJ5dSN/E---3.1_9571.p',conj_0) ).

thf(fact_2_abe,axiom,
    vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eL74IJ5dSN/E---3.1_9571.p',fact_2_abe) ).

thf(fact_1019_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eL74IJ5dSN/E---3.1_9571.p',fact_1019_Suc__1) ).

thf(fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    file('/export/starexec/sandbox/tmp/tmp.eL74IJ5dSN/E---3.1_9571.p',fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

thf(fact_0_True,axiom,
    ( ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
    = pr ),
    file('/export/starexec/sandbox/tmp/tmp.eL74IJ5dSN/E---3.1_9571.p',fact_0_True) ).

thf(c_0_5,negated_conjecture,
    ~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_6,plain,
    vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_2_abe]) ).

thf(c_0_7,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_1019_Suc__1]) ).

thf(c_0_8,plain,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    inference(split_conjunct,[status(thm)],[fact_9__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

thf(c_0_9,plain,
    ( ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
    = pr ),
    inference(split_conjunct,[status(thm)],[fact_0_True]) ).

thf(c_0_10,negated_conjecture,
    ~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_11,plain,
    vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) ) ) ) @ ( vEBT_VEBT_low @ za @ ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).

thf(c_0_12,plain,
    ( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
    = na ),
    inference(rw,[status(thm)],[c_0_8,c_0_7]) ).

thf(c_0_13,plain,
    ( ( vEBT_VEBT_high @ za @ na )
    = pr ),
    inference(rw,[status(thm)],[c_0_9,c_0_8]) ).

thf(c_0_14,negated_conjecture,
    ~ ( vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ za @ na ) ) @ ( vEBT_VEBT_low @ za @ na ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_8]) ).

thf(c_0_15,plain,
    vEBT_vebt_member @ ( nth_VEBT_VEBT @ treeList @ pr ) @ ( vEBT_VEBT_low @ za @ na ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_12]) ).

thf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.50/2.58  % Problem    : ITP239^1 : TPTP v8.1.2. Released v8.1.0.
% 2.50/2.59  % Command    : run_E %s %d THM
% 2.59/2.80  % Computer : n016.cluster.edu
% 2.59/2.80  % Model    : x86_64 x86_64
% 2.59/2.80  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.59/2.80  % Memory   : 8042.1875MB
% 2.59/2.80  % OS       : Linux 3.10.0-693.el7.x86_64
% 2.59/2.80  % CPULimit   : 300
% 2.59/2.80  % WCLimit    : 300
% 2.59/2.80  % DateTime   : Fri May  3 12:47:18 EDT 2024
% 2.59/2.80  % CPUTime    : 
% 5.35/5.51  Running higher-order theorem proving
% 5.35/5.51  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.eL74IJ5dSN/E---3.1_9571.p
% 69.69/22.27  # Version: 3.1.0-ho
% 69.69/22.27  # partial match(1): HMLMSMSMSSLCHFA
% 69.69/22.27  # Preprocessing class: HMLMSMLMSSLCHFA.
% 69.69/22.27  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 69.69/22.27  # Starting new_ho_10 with 1500s (5) cores
% 69.69/22.27  # Starting sh5l with 300s (1) cores
% 69.69/22.27  # Starting new_bool_1 with 300s (1) cores
% 69.69/22.27  # Starting new_bool_2 with 300s (1) cores
% 69.69/22.27  # new_bool_2 with pid 10896 completed with status 0
% 69.69/22.27  # Result found by new_bool_2
% 69.69/22.27  # partial match(1): HMLMSMSMSSLCHFA
% 69.69/22.27  # Preprocessing class: HMLMSMLMSSLCHFA.
% 69.69/22.27  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 69.69/22.27  # Starting new_ho_10 with 1500s (5) cores
% 69.69/22.27  # Starting sh5l with 300s (1) cores
% 69.69/22.27  # Starting new_bool_1 with 300s (1) cores
% 69.69/22.27  # Starting new_bool_2 with 300s (1) cores
% 69.69/22.27  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 69.69/22.27  # Search class: HGHSM-SMLM32-DHFFFFBN
% 69.69/22.27  # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 69.69/22.27  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 69.69/22.27  # Starting new_ho_10 with 180s (1) cores
% 69.69/22.27  # new_ho_10 with pid 10981 completed with status 0
% 69.69/22.27  # Result found by new_ho_10
% 69.69/22.27  # partial match(1): HMLMSMSMSSLCHFA
% 69.69/22.27  # Preprocessing class: HMLMSMLMSSLCHFA.
% 69.69/22.27  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 69.69/22.27  # Starting new_ho_10 with 1500s (5) cores
% 69.69/22.27  # Starting sh5l with 300s (1) cores
% 69.69/22.27  # Starting new_bool_1 with 300s (1) cores
% 69.69/22.27  # Starting new_bool_2 with 300s (1) cores
% 69.69/22.27  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 69.69/22.27  # Search class: HGHSM-SMLM32-DHFFFFBN
% 69.69/22.27  # partial match(1): HGHSM-SMLM32-DHFFFSBN
% 69.69/22.27  # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 69.69/22.27  # Starting new_ho_10 with 180s (1) cores
% 69.69/22.27  # Preprocessing time       : 0.276 s
% 69.69/22.27  # Presaturation interreduction done
% 69.69/22.27  
% 69.69/22.27  # Proof found!
% 69.69/22.27  # SZS status Theorem
% 69.69/22.27  # SZS output start CNFRefutation
% See solution above
% 69.69/22.27  # Parsed axioms                        : 11244
% 69.69/22.27  # Removed by relevancy pruning/SinE    : 7135
% 69.69/22.27  # Initial clauses                      : 11379
% 69.69/22.27  # Removed in clause preprocessing      : 2021
% 69.69/22.27  # Initial clauses in saturation        : 9358
% 69.69/22.27  # Processed clauses                    : 11623
% 69.69/22.27  # ...of these trivial                  : 343
% 69.69/22.27  # ...subsumed                          : 3140
% 69.69/22.27  # ...remaining for further processing  : 8139
% 69.69/22.27  # Other redundant clauses eliminated   : 2959
% 69.69/22.27  # Clauses deleted for lack of memory   : 0
% 69.69/22.27  # Backward-subsumed                    : 56
% 69.69/22.27  # Backward-rewritten                   : 111
% 69.69/22.27  # Generated clauses                    : 2591
% 69.69/22.27  # ...of the previous two non-redundant : 2224
% 69.69/22.27  # ...aggressively subsumed             : 0
% 69.69/22.27  # Contextual simplify-reflections      : 124
% 69.69/22.27  # Paramodulations                      : 7
% 69.69/22.27  # Factorizations                       : 0
% 69.69/22.27  # NegExts                              : 0
% 69.69/22.27  # Equation resolutions                 : 2959
% 69.69/22.27  # Disequality decompositions           : 0
% 69.69/22.27  # Total rewrite steps                  : 19745
% 69.69/22.27  # ...of those cached                   : 18904
% 69.69/22.27  # Propositional unsat checks           : 0
% 69.69/22.27  #    Propositional check models        : 0
% 69.69/22.27  #    Propositional check unsatisfiable : 0
% 69.69/22.27  #    Propositional clauses             : 0
% 69.69/22.27  #    Propositional clauses after purity: 0
% 69.69/22.27  #    Propositional unsat core size     : 0
% 69.69/22.27  #    Propositional preprocessing time  : 0.000
% 69.69/22.27  #    Propositional encoding time       : 0.000
% 69.69/22.27  #    Propositional solver time         : 0.000
% 69.69/22.27  #    Success case prop preproc time    : 0.000
% 69.69/22.27  #    Success case prop encoding time   : 0.000
% 69.69/22.27  #    Success case prop solver time     : 0.000
% 69.69/22.27  # Current number of processed clauses  : 44
% 69.69/22.27  #    Positive orientable unit clauses  : 14
% 69.69/22.27  #    Positive unorientable unit clauses: 0
% 69.69/22.27  #    Negative unit clauses             : 30
% 69.69/22.27  #    Non-unit-clauses                  : 0
% 69.69/22.27  # Current number of unprocessed clauses: 5304
% 69.69/22.27  # ...number of literals in the above   : 18665
% 69.69/22.27  # Current number of archived formulas  : 0
% 69.69/22.27  # Current number of archived clauses   : 5512
% 69.69/22.27  # Clause-clause subsumption calls (NU) : 31619599
% 69.69/22.27  # Rec. Clause-clause subsumption calls : 1813101
% 69.69/22.27  # Non-unit clause-clause subsumptions  : 3104
% 69.69/22.27  # Unit Clause-clause subsumption calls : 36115
% 69.69/22.27  # Rewrite failures with RHS unbound    : 0
% 69.69/22.27  # BW rewrite match attempts            : 892
% 69.69/22.27  # BW rewrite match successes           : 287
% 69.69/22.27  # Condensation attempts                : 11624
% 69.69/22.27  # Condensation successes               : 48
% 69.69/22.27  # Termbank termtop insertions          : 3446451
% 69.69/22.27  # Search garbage collected termcells   : 200300
% 69.69/22.27  
% 69.69/22.27  # -------------------------------------------------
% 69.69/22.27  # User time                : 15.722 s
% 69.69/22.27  # System time              : 0.136 s
% 69.69/22.27  # Total time               : 15.858 s
% 69.69/22.27  # Maximum resident set size: 51228 pages
% 69.69/22.27  
% 69.69/22.27  # -------------------------------------------------
% 69.69/22.27  # User time                : 16.473 s
% 69.69/22.27  # System time              : 0.163 s
% 69.69/22.27  # Total time               : 16.636 s
% 69.69/22.27  # Maximum resident set size: 27712 pages
% 69.69/22.27  % E---3.1 exiting
% 69.69/22.27  % E exiting
%------------------------------------------------------------------------------